منابع مشابه
Topologies for point distributions
The concepts of void and cluster for an arbitrary point distribution in a domain g are defined and characterized by some parameters such as volume, density, number of points belonging to them, shape, etc. After assigning a weight to each void and cluster-which is a function of its characteristics-the concept of distance between two point configurations Sl and Sz in g is introduced, both with an...
متن کاملCapacity-Constrained Delaunay Triangulation for point distributions
Sample point distributions possessing blue noise spectral characteristics play a central role in computer graphics, but are notoriously difficult to generate. We describe an algorithm to very efficiently generate these distributions. The core idea behind our method is to compute a Capacity-Constrained Delaunay Triangulation (CCDT), namely, given a simple polygon P in the plane, and the desired ...
متن کاملSigma Point Transformation for Gaussian Mixture Distributions
This paper describes the development of an approximate method for propagating uncertainty through stochastic dynamical systems using a quadrature rule integration based method. The development of quadrature rules for Gaussian mixture distributions is discussed. A numerical solution to this problem is considered that uses a Gram-Schmidt process. Simulation results are presented where the quadrat...
متن کاملDistance between Distributions with Special Topologies of Cost Matrices
Abstract Comparing two distributions plays important role in many problems. The traditional minimum cost flow problem has been utilized as a distance measure between two distributions (transportation problem) such as the earth mover’ distance (EMD). If the distributions have b number of bins, the cost matrix is b × b square matrix. While generic algorithms such as Simplex method to compute the ...
متن کاملFixed Point for Negamaxing Probability Distributions on Regular Trees
| Consider a rooted tree with branching factor b > 1 having b h leafs, each at distance h from the root. Suppose the leafs are assigned real values chosen i.i.d. from some probability density, and the interior nodes of the tree are then also assigned values recursively, according to the negamax rule: The value of a node is the maximum of the negated values of its children. The root will then be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Physics
سال: 1987
ISSN: 0022-2488,1089-7658
DOI: 10.1063/1.527702